Branch and cut methods for network optimization

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Branch-and-cut for complementarity-constrained optimization

We report and analyze the results of our computational testing of branchand-cut for the complementarity-constrained optimization problem (CCOP). Besides the MIP cuts commonly present in commercial optimization software, we used inequalities that explore complementarity constraints. To do so, we generalized two families of cuts proposed earlier by de Farias, Johnson, and Nemhauser that had never...

متن کامل

Branch-and-cut Algorithms for Integer Programming, Branch-and-cut

Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming probl...

متن کامل

Parallel branch, cut, and price for large-scale discrete optimization

In discrete optimization, most exact solution approaches are based on branch and bound, which is conceptually easy to parallelize in its simplest forms. More sophisticated variants, such as the so-called branch, cut, and price algorithms, are more difficult to parallelize because of the need to share large amounts of knowledge discovered during the search process. In the first part of the paper...

متن کامل

Branch-and-Cut Algorithms for Combinatorial Optimization Problems

Branch-and-cut methods are very successful techniques for solving a wide variety of integer programming problems, and they can provide a guarantee of optimality. We describe how a branch-and-cut method can be tailored to a specific integer programming problem, and how families of general cutting planes can be used to solve a wide variety of problems. Other important aspects of successful implem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 2001

ISSN: 0895-7177

DOI: 10.1016/s0895-7177(00)00258-2